Matching speed and locality
نویسندگان
چکیده
منابع مشابه
Locality Preserving Matching
Seeking reliable correspondences between two feature sets is a fundamental and important task in computer vision. This paper attempts to remove mismatches from given putative image feature correspondences. To achieve the goal, an efficient approach, termed as locality preserving matching (LPM), is designed, the principle of which is to maintain the local neighborhood structures of those potenti...
متن کاملCapacity Releasing Diffusion for Speed and Locality
Note an ineligible arc (v, u) must remain ineligible until the next relabel of v, so we only need to check each arc out of v once between consecutive relabels. We use current(v) to keep track of the arcs out of v that we have checked since the last relabel of v. We always pick an active vertex v with the lowest label. Then for any eligible arc (v, u), we know m(u) ≤ d(u), so we can push at leas...
متن کاملCapacity Releasing Diffusion for Speed and Locality
Diffusions and related random walk procedures are of central importance in many areas of machine learning, data analysis, and applied mathematics. Because they spread mass agnostically at each step in an iterative manner, they can sometimes spread mass “too aggressively,” thereby failing to find the “right” clusters. We introduce a novel Capacity Releasing Diffusion (CRD) Process, which is both...
متن کاملInstance-Based Matching of Large Ontologies Using Locality-Sensitive Hashing
In this paper, we describe a mechanism for ontology alignment using instance based matching of types (or classes). Instance-based matching is known to be a useful technique for matching ontologies that have different names and different structures. A key problem in instance matching of types, however, is scaling the matching algorithm to (a) handle types with a large number of instances, and (b...
متن کاملHigh-Speed Matching of Vulnerability Signatures
Vulnerability signatures offer better precision and flexibility than exploit signatures when detecting network attacks. We show that it is possible to detect vulnerability signatures in high-performance network intrusion detection systems, by developing a matching architecture that is specialized to the task of vulnerability signatures. Our architecture is based upon: i) the use of high-speed p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1998
ISSN: 0028-0836,1476-4687
DOI: 10.1038/33808